Arithmetic Coded Vector Spiht with Color Image Coding* Classified Tree-multistage Vq For

نویسنده

  • Debargha Mukherjee
چکیده

A vector extension of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm, named vector-SPIHT (VSPIHT), using trained classified successive refinement VQ, has recently been proposed. In this work, vector set-partitioning is applied to multispectral image compression, in particular to 24-bit color images. Since the individual spectral components are sufficiently correlated, VSPIHT can effectively exploit both the inter-component redundancy as well as the spatial redundancy within each subband of each component, to yield performance superior to separate scalar SPIHT coding of each component. Adaptive arithmetic coding of the first stage VQ index for each class, as well as the significance information, further improves the performance. Coding results demonstrate that the vector-based approach for color images significantly outperforms the scalar counterpart in the mean-squared-error sense.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic coded vector SPIHT with classified tree-multistage VQ for color image coding

A vector extension of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm, named vector-SPIHT (VSPIHT), using trained classified successive refinement VQ, has recently been proposed. In this work, vector set-partitioning is applied to multispectral image compression, in particular to 24-bit color images. Since the individual spectral components are sufficiently correlated, VSPIHT can e...

متن کامل

Vector Set Partitioning with Classified Successive Refinement Vq for Embedded Wavelet Image Coding*

Set Partitioning in Hierarchical Trees (SPIHT), proposed by Said and Pearlman [1], is generally regarded as a very efficient wavelet-based still image compression scheme. The algorithm uses an efficient, joint scanning and bit-allocation mechanism for quantizing the scalar wavelet coefficients, and produces a perfectly embedded bitstream. This work extends set partitioning to scan vectors of wa...

متن کامل

Linear-translate constrained storage VQ for VSPIHT wavelet image compression

A new Constrained Storage VQ (CSVQ) structure based on linear transforms and translates of a common root codebook is proposed. The new VQ structure, named LT-CSVQ (Linear Translate CSVQ), acts as a building block for multistage VQ implementations (LT-CS-MSVQ), and significantly reduces storage requirements from that required in tree-multistage VQ implementations. LT-CS-MSVQ is most appropriate ...

متن کامل

Wavelet-based Lossy-to-lossless Medical Image Compression Using Dynamic Vq and Spiht Coding

As the coming era of digitized medical information, a close-al-hand challenge to deal with is the storage and transmission requirement of enormous data, including medical images. Compression is one of the indispensable techniques to solve this problem. In this work, we propose a dynamic vector quantization (DVQ) scheme with distortion-constrained codebook replenishment (DCCR) mechanism in wavel...

متن کامل

Vector set partitioning with classified successive refinement VQ for embedded wavelet image and video coding

The Set Partitioning in Hierarchical Trees (SPIHT) approach for still image compression proposed by Said and Pearlman [8], is one of the most efficient embedded gray image compression schemes till date. The algorithm relies on a very efficient scanning cum bit-allocation scheme for quantizing the coefficients obtained by a wavelet decomposition of an image. In this paper, we adopt this scheme t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004